Testing for Serial Independence of Generalized Errors

نویسنده

  • Zaichao Du
چکیده

In this paper, we develop a Neyman-type smooth test for the serial dependence of unobservable generalized errors. Our test is "nuisance parameter-free" in the sense that model parameter estimation uncertainty has no impact on the limit distribution of the test statistic.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nonparametric Bootstrap Tests for Independence of Generalized Errors

In this paper, we develop a general method of testing for independence when unobservable generalized errors are involved. Our method can be applied to testing for serial independence of generalized errors, and testing for independence between the generalized errors and observable covariates. The former can serve as a uni…ed approach to testing adequacy of time series models, as model adequacy o...

متن کامل

A Nonparametric Distribution-Free Test for Serial Independence of Errors∗

In this paper, we propose a test for the serial independence of unobservable errors in locationscale models. We consider a Hoeffding-Blum-Kiefer-Rosenblat type empirical process applied to residuals, and show that under certain conditions it converges weakly to the same limit as the process based on true errors. We then consider a generalized spectral test applied to estimated residuals, and ge...

متن کامل

Independence of an Equivariant and Invariant‎ Functions in Generalized Normal Family‎

In this paper we explain a necessary and sufficent condition for independence between any arbitrary statistics with sufficient statistics which is also maximum likelihood estimator in a general‎ ‎exponential family with location and scale parameter namely generalized normal distribution‎. ‎At the end‎, ‎it is shown that the converse is true except in the asymptotic cases‎.

متن کامل

Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence for time

We show that Kolmogorov complexity and such its estimators as universal codes (or data compression methods) can be applied for hypothesis testing in a framework of classical mathematical statistics. The methods for identity testing and nonparametric testing of serial independence for time series are described. AMS subject classification: 60G10, 62M07, 68Q30, 68W01, 94A29.

متن کامل

Convergence theorems of multi-step iterative algorithm with errors for generalized asymptotically quasi-nonexpansive mappings in Banach spaces

The purpose of this paper is to study and give the necessary andsufficient condition of strong convergence of the multi-step iterative algorithmwith errors for a finite family of generalized asymptotically quasi-nonexpansivemappings to converge to common fixed points in Banach spaces. Our resultsextend and improve some recent results in the literature (see, e.g. [2, 3, 5, 6, 7, 8,11, 14, 19]).

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008